- induced ordering
- мат.индуцированное упорядочение
English-Russian scientific dictionary. 2008.
induced ordering
Смотреть что такое "induced ordering" в других словарях:
Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques … Wikipedia
Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use… … Wikipedia
Charge ordering — (CO) is a (first or second order) phase transition occurring mostly in strongly correlated materials such as transition metal oxides or organic conductors. Due to the strong interaction, the charge is localized on different sites leading to a… … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Ordered field — In mathematics, an ordered field is a field together with a total ordering of its elements that is compatible with the field operations. Historically, the axiomatization of an ordered field was abstracted gradually from the real numbers, by… … Wikipedia
Poincaré–Birkhoff–Witt theorem — In the theory of Lie algebras, the Poincaré–Birkhoff–Witt theorem (Poincaré (1900), G. D. Birkhoff (1937), Witt (1937); frequently contracted to PBW theorem) is a result giving an explicit description of the universal enveloping algebra of a Lie… … Wikipedia
Ordered graph — An ordered graph is a graph with a total order over its nodes. In an ordered graph, the parents of a node are the nodes that are joined to it and precede it in the ordering. More precisely, n is a parent of m in the ordered graph if and n < m … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Multiferroics — have been formally defined as materials that exhibit more than one primary ferroic order parameter simultaneously (i.e. in a single phase).[1] The four basic primary ferroic order parameters are ferromagnetism, ferroelectricity, ferroelasticity… … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
